Parsing in two frameworks: finite-state and functional dependency grammar
نویسنده
چکیده
منابع مشابه
Two-Way Finite Automata And Dependency Grammar: A Parsing Method For Inflectional Free Word Order Languages
This paper presents a parser of an inflectional free word order language, namely Finnish. Two-way finite automata are used to specify a functional dependency grammar and to actually parse Finnish sentences. Each automaton gives a functional description of a dependency structure within a constituent. Dynamic local control of the parser is realized by augmenting the automata with simple operation...
متن کاملRefining the Design of a Contracting Finite-State Dependency Parser
This work complements a parallel paper of a new finite-state dependency parser architecture (Yli-Jyrä, 2012) by a proposal for a linguistically elaborated morphology-syntax interface and its finite-state implementation. The proposed interface extends Gaifman’s (1965) classical dependency rule formalism by separating lexical word forms and morphological categories from syntactic categories. The ...
متن کاملParsing Swedish
CG is a reductionistic constraint rule formalism whose input is lexically analysed ambiguous text and whose output is disambiguated text. Disambiguation is carried out by constraints on lemmas and tags that discard alternative analyses on the basis of contextual information, typically coded by a linguist. The ENGCG morphosyntactic tagger was introduced in 1992 (Voutilainen & al.) and compared w...
متن کاملAn Earley-type recognizer for dependency grammar
The paper is a first attempt to fill a gap in the dependency literature, by providing a mathematical result on the complexity of recognition with a dependency grammar. The paper describes an improved Earley-type recognizer with a complexity O(IGl2n3). The improvement is due to a precompilation of the dependency rules into parse tables, that determine the conditions of applicability of two prima...
متن کاملA Finite-State Parser with Dependency Structure Output
Dependency parsers and nite-state parsers are both capable of rapid and robust parsing of natural language. Dependency parsers produce richer output structures, while nite-state parsers can be more eecient. We show how a nite-state parser can be used to produce dependency structures for most phrase types, with an O(n 2) complexity in the number of words. The parser allows syntactically ambiguou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999